北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2010, Vol. 33 ›› Issue (3): 135-138.doi: 10.13190/jbupt.201003.135.zhouyj

• 研究报告 • 上一篇    下一篇

(n,n-1,m)卷积码的盲识别

周亚建1,刘 健2   

  1. (1. 北京邮电大学网络与交换技术国家重点实验室,北京 100876; 
    2. 西安电子科技大学综合业务网理论及关键技术国家重点实验室,西安 710071)
  • 出版日期:2010-06-28 发布日期:2010-06-28
  • 作者简介:周亚建(1971—), 男, 讲师
  • 基金资助:

    国家自然科学基金项目(60972077)

A Blind Recognition of the (n, n-1, m) Convolution Code

ZHOU Ya-jian1, LIU Jian2   

  1. (1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China; 

    2. State Key Laboratory of Integrated Service Networks,  Xidian University,  Xi'an 710071,  China)

  • Online:2010-06-28 Published:2010-06-28
  • Contact: ZHOU Ya-jian E-mail:yajian@bupt.edu.cn.

摘要:

针对信道编码的盲识别问题,提出了码率为(n-1)/n卷积码的盲识别算法. 首先建立了盲识别的数

学模型,然后对截获码序列所构造的矩阵进行分解求解校验矩阵,通过对校验矩阵进行初等变换,最

终辨识编码参数. 仿真实验表明,该算法可对卷积码进行有效识别.

关键词: 盲识别, 信道编码, 卷积码, 误码率, 矩阵分解

Abstract:

In order to solve the problem of the blind recognition of channel coding, a blind recognition method

of identifying (n-1)/n convolution code is proposed. Firstly, a mathematical model of blind recog-

nition is given, followed by a method of solving parity check matrix through decomposition of the mat-

rix constructed by the intercepted code. Meanwhile, by the elementary transform of the parity check

matrix, the blind recognition of convolution code can be achieved. Simulations show that the proposed

method can recognize the convolution code parameters effectively.

Key words: blind recognition, channel code, convolution code, bit error rate, decomposition of matrix